Practical techniques for purging deleted data using liveness information
نویسندگان
چکیده
منابع مشابه
Practical Techniques for Searches on Encrypted Data
It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and...
متن کاملData Mining Techniques for the Practical Bioinformatician
The use of computing to organize, manage, and analyse biological and clinical data has become an important element of biology and medical research. In the 1990s, large quantities of DNA sequence data were generated by the Human Genome Project and other genome sequencing efforts. Computing projects in algorithms, software, and databases were crucial in the automated assembly and analysis of the ...
متن کاملSE Minneapolis , MN 55455 - 0159 USA TR 07 - 009 Practical Techniques for Eliminating Storage of Deleted Data
The layered design of modern file systems hides the liveness of data from the underlying storage systems. In this paper, we define a generic “purge” operation that can be used by a file system to pass liveness information to the storage system with minimal changes in the layer interfaces. We present three approaches for implementing such a purge operation: direct call, zero pages, and flagged w...
متن کاملInferring purging from pedigree data.
The harmful effects of inbreeding can be reduced if deleterious recessive alleles were removed (purged) by selection against homozygotes in earlier generations. If only a few generations are involved, purging is due almost entirely to recessive alleles that reduce fitness to near zero. In this case the amount of purging and allele frequency change can be inferred approximately from pedigree dat...
متن کاملOn Liveness Analysis through Linear Algebraic Techniques
Proving properties of Place/Transition Nets through Linear Algebraic Techniques is very interesting because of the polynomial complexity of the algorithms used for this purpose. In this sense, many works have been devoted to the linear analysis of marking related properties (e.g. boundedness of the state space, mutual exclusions, etc.). Nevertheless, few results exist related to linear analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 2008
ISSN: 0163-5980
DOI: 10.1145/1400097.1400107